Fast Wait-free Algorithms for Lattice Agreement and Renaming
نویسنده
چکیده
In a shared-memory system, n independent asynchronous processes, with distinct names in the range f0; : : : ; N ? 1g, communicate by reading and writing to shared memory; processes operate at diierent speeds or fail entirely. A wait-free algorithm guarantees that a non-faulty process completes its execution regardless of the behavior of other processes, thus tolerating an arbitrary number of crash failures and diierent processes' speed. This paper considers algorithms whose step complexity adjusts to the level of contention in the system. An algorithm is range-independent if its complexity depends on the number of processes (which is known in advance) but not on the range of names. An algorithm is fast if its complexity depends only on the actual number of active processes, k, which is unknown in advance and may change in diierent executions of the algorithm. This paper presents fast algorithms for two important decision problems, lattice agreement and renaming with a linear name space, using only read and write operations. We present a fast algorithm for lattice agreement with step complexity O(k log k) and a fast algorithm for (6k ? 1)-renaming with step complexity O(k log k).
منابع مشابه
Adaptive and Efficient Algorithms for Lattice Agreement and Renaming
In a shared-memory system, n independent asynchronous processes, with distinct names in the range f0;:: : ; N ? 1g, communicate by reading and writing to shared registers. An algorithmis wait-free if a process completes its execution regardless of the behaviorof other processes. This paper considers wait-free algorithms whose complexity adjusts to the level of contention in the system: An algor...
متن کاملWait-Free Algorithms for Fast, Long-Lived Renaming
We consider wait-free solutions to the renaming problem for shared-memory multiprocessing systems [3, 5]. In the renaming problem, processes are required to choose new names in order to reduce the size of their name space. Previous solutions to the renaming problem have time complexity that is dependent on the size of the original name space, and allow processes to acquire names only once. In t...
متن کاملFast , Long - Lived Renaming ( Extended
We consider wait-free solutions to the renaming problem for shared-memory multiprocessing systems 3, 5]. In the renaming problem, processes are required to choose new names in order to reduce the size of their name space. Previous solutions to the renaming problem have time complexity that is dependent on the size of the original name space, and allow processes to acquire names only once. In th...
متن کاملFast, Long-Lived Renaming
We consider wait-free solutions to the renaming problem for shared-memory multiprocessing systems [3, 5]. In the renaming problem, processes are required to choose new names in order to reduce the size of their name space. Previous solutions to the renaming problem have time complexity that is dependent on the size of the original name space, and allow processes to acquire names only once. In t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999